New Method for Finding Initial Cluster Centroids in K-means Algorithm
نویسندگان
چکیده
منابع مشابه
Enhanced Initial Centroids for K-means Algorithm
This paper focuses on the enhanced initial centroids for the K-means algorithm. The original kmeans is using the random choice of init ial seeds which is a major limitation of the orig inal K-means algorithm because it produces less reliab le result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initial...
متن کاملSelection of Initial Centroids for k-Means Algorithm
Clustering is one of the important data mining techniques. k-Means [1] is one of the most important algorithm for Clustering. Traditional k-Means algorithm selects initial centroids randomly and in k-Means algorithm result of clustering highly depends on selection of initial centroids. k-Means algorithm is sensitive to initial centroids so proper selection of initial centroids is necessary. Thi...
متن کاملA new Initial Centroid finding Method based on Dissimilarity Tree for K-means Algorithm
—Cluster analysis is one of the primary data analysis technique in data mining and K-means is one of the commonly used partitioning clustering algorithm. In K-means algorithm, resulting set of clusters depend on the choice of initial centroids. If we can find initial centroids which are coherent with the arrangement of data, the better set of clusters can be obtained. This paper proposes a meth...
متن کاملA New Initialization Method to Originate Initial Cluster Centers for K-Means Algorithm
K means algorithm is most popular partition based algorithm that is widely used in data clustering. A Lot of algorithms have been proposed for data clustering using K-Means algorithm due to its simplicity, efficiency and ease convergence. In spite this K-Means algorithm has some drawbacks like initial cluster centers, stuck in local optima etc. In this study, a new method is proposed to address...
متن کاملAn Agent Oriented Approach for Implementation of the Range Method of Initial Centroids in K-Means Clustering Data Mining Algorithm
Intelligent agents are today accepted as powerful tools for data mining in a distributed environment. Artificial Intelligence (AI) algorithms are utilized to render software agents more intelligent. Knowledge discovery and data mining methods have been applied to discover hidden patterns and relations in complex datasets where clustering is one of the most important approaches used for this pur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/12890-9837